On the Capacity Region of Cognitive Multiple Access over White Space Channels

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extension of the Coverage Region of Multiple Access Channels by Using a Relay

From practical and theoretical viewpoints, performance analysis of communication systems by using information-theoretic results is important. In this paper, based on our previous work on Multiple Access Channel (MAC) and Multiple Access Relay Channel (MARC), we analyze the impact of a relay on the fundamental wireless communications concept, i.e., coverage region of MARC, as a basic model for u...

متن کامل

Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels

Abstract— A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information intended for the destination. Moreover, user 1 wishes to keep its confidential information as secret as possible from user 2. A deterministic GMAC is first studie...

متن کامل

Time-Reversal Space Division Multiple Access over Multi-path Channels

A novel concept of time-reversal division multiple access (TRDMA) is proposed in [1] as a low-complexity, energy-efficient wireless multi-user access method. In this paper, we first generalize the work in [1] as a pre-filtering based space division multiple access (SDMA) communication system, where each user’s signature waveform is derived from the information of CIRs between basestation (BS) a...

متن کامل

On the Capacity Region of Multiple Access Channel

The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.

متن کامل

On the Capacity Region of Multiple Access Adder Channel

The model of communication is as follows (see Fig. 1). Each user i chooses a label mi uniformly from its message set [Mi] and sends the codeword ei(mi). All the users send their codewords simultaneously, symbol by symbol. After n transmissions, a sequence of n output symbols (y1, y2, . . . , yn) is received according to the transition probability matrix. This is then decoded by the decoding fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Journal on Selected Areas in Communications

سال: 2013

ISSN: 0733-8716

DOI: 10.1109/jsac.2013.131105